A Parametrization of Equilateral Triangles Having Integer Coordinates
نویسنده
چکیده
We study the existence of equilateral triangles of given side lengths and with integer coordinates in dimension three. We show that such a triangle exists if and only if their side lengths are of the form √ 2(m2 − mn + n2) for some integers m, n. We also show a similar characterization for the sides of a regular tetrahedron in Z: such a tetrahedron exists if and only if the sides are of the form k √ 2, for some k ∈ N. The classification of all the equilateral triangles in Z contained in a given plane is studied and the beginning analysis is presented. A more general parametrization is proven under a special assumption. Some related questions are left in the end.
منابع مشابه
Ehrhart's polynomial for equilateral triangles in ℤ3
In this paper we calculate the Ehrhart’s polynomial associated with a 2-dimensional regular polytope (i.e. equilateral triangles) in Z. The polynomial takes a relatively simple form in terms of the coordinates of the vertices of the triangle. We give some equivalent formula in terms of a parametrization of these objects which allows one to construct equilateral triangles with given properties. ...
متن کاملA Characterization of All Equilateral Triangles in Z
This paper is a continuation of the work started in [1] and [2]. We extend one of the theorems that gave a way to construct equilateral triangles whose vertices have integer coordinates to the general situation. An approximate extrapolation formula for the sequence ET (n) of all equilateral triangles with vertices in {0, 1, 2, ..., n}3 (A 102698) is given and the asymptotic behavior of this seq...
متن کاملMonochromatic equilateral right triangles on the integer grid
For any coloring of the N×N grid using less than log log n colors, one can always find a monochromatic equilateral right triangle, a triangle with vertex coordinates (x, y), (x + d, y), and (x, y + d). AMS Mathematics Subject Classification: 05D10
متن کاملCounting All Equilateral Triangles In
We describe a procedure of counting all equilateral triangles in the three dimensional space whose coordinates are allowed only in the set {0, 1, ..., n}. This sequence is denoted here by ET (n) and it has the entry A102698 in “The On-Line Encyclopedia of Integer Sequences”. The procedure is implemented in Maple and its main idea is based on the results in [3]. Using this we calculated the valu...
متن کاملEquilateral Triangles in Finite Metric Spaces
In the context of finite metric spaces with integer distances, we investigate the new Ramsey-type question of how many points can a space contain and yet be free of equilateral triangles. In particular, for finite metric spaces with distances in the set {1, . . . , n}, the number Dn is defined as the least number of points the space must contain in order to be sure that there will be an equilat...
متن کامل